Two related questions on total coloring of cubic graphs
نویسنده
چکیده
By proposing two questions on total colorings of cubic graphs of large girth, we investigate a possible connection between girth and total chromatic parameters in cubic graphs.
منابع مشابه
Equitable total coloring of corona of cubic graphs
The minimum number of total independent sets of V ∪ E of graph G(V,E) is called the total chromatic number of G, denoted by χ′′(G). If difference of cardinalities of any two total independent sets is at most one, then the minimum number of total independent partition sets of V ∪E is called the equitable total chromatic number, and denoted by χ′′ =(G). In this paper we consider equitable total c...
متن کاملRelaxed two-coloring of cubic graphs
We show that any graph of maximum degree at most has a two-coloring, such that one color-class is an independent set while the other color induces monochromatic components of order at most . On the other hand for any constant we exhibit a -regular graph, such that the deletion of any independent set leaves at least one component of order greater than . Similar results are obtained for coloring ...
متن کاملTotal and fractional total colourings of circulant graphs
In this paper, the total chromatic number and fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional total chromatic number and for 4-regular circulant graphs we find the total chromatic number for some cases and we give the exact value of the fractional total chromatic number in most cases.
متن کاملSnarks with Total Chromatic Number 5
A k-total-coloring of G is an assignment of k colors to the edges and vertices of G, so that adjacent and incident elements have different colors. The total chromatic number of G, denoted by χT (G), is the least k for which G has a k-total-coloring. It was proved by Rosenfeld that the total chromatic number of a cubic graph is either 4 or 5. Cubic graphs with χT = 4 are said to be Type 1, and c...
متن کاملOn the Maximum Number of Dominating Classes in Graph Coloring
In this paper we investigate the dominating- -color number، of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].
متن کامل